Nicholas Pippenger Algebraic Complexity Theory
نویسنده
چکیده
Algebraic complexity theory, the study of the minimum number of operations suficient o perform algebraic computations, is surveyed with emphasis on the general theory of bilinear forms and two of its applications: polynomial multiplication and matrix multiplication. Though by no means exhausting algebraic complexity theory, these topics illustrate well its development and its methods, and provide examples of its most striking successes.
منابع مشابه
The complexity of computations by networks by Nicholas Pippenger
We survey the current state of knowledge concerning the computation of Boolean functions by networks, with particular emphasis on the addition and multiplication of binary numbers.
متن کاملComparative Schematology and Pebbling with Auxiliary Pushdowns
This paper has three claims to interest. First, it combines comparative schematology with complexity theory. This combination is capable of distinguishing among Strong's "languages of maximal power," a distinction not possible when comparative schematology is based on computability considerations alone, and it is capable of establishing exponential disparities in running times, a capability not...
متن کاملRigid Divisibility Sequences Generated by Polynomial Iteration
The goal of this thesis is to explore the properties of a certain class of sequences, rigid divisibility sequences, generated by the iteration of certain polynomials whose coefficients are algebraic integers. The main goal is to provide, as far as is possible, a classification and description of those polynomials which generate rigid divisibility sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002